Cm20019—computation Iii: Formal Logic and Semantics Exercise Sheet 9, 23.11.2007 Alessio Guglielmi
ثبت نشده
چکیده
Problem 1. Write a Prolog program, consisting only of pure Horn clauses, that orders a list of natural numbers by the quicksort algorithm. Problem 2. Write a Prolog program, consisting only of pure Horn clauses, that computes all permutations of a given list. Problem 3. Write a Prolog program, consisting only of pure Horn clauses, that nds all normal magic squares of order 3. Please consult Wikipedia for the deenitions of quicksort and magic square, respectively, The web page for the course is at [1]. You can nd other exercises in Dan Richardson's notes, available from the web page.
منابع مشابه
On Structuring Proof Search for First Order Linear Logic
Full first order linear logic can be presented as an abstract logic programming language in Miller’s system Forum, which yields a sensible operational interpretation in the ‘proof search as computation’ paradigm. However, Forum still has to deal with syntactic details that would normally be ignored by a reasonable operational semantics. In this respect, Forum improves on Gentzen systems for lin...
متن کاملNon-commutativity and MELL in the Calculus of Structures
We introduce the calculus of structures: it is more general than the sequent calculus and it allows for cut elimination and the subformula property. We show a simple extension of multiplicative linear logic, by a self-dual noncommutative operator inspired by CCS, that seems not to be expressible in the sequent calculus. Then we show that multiplicative exponential linear logic benefits from its...
متن کاملALinear LogicViewofGamma Style Computations as Proof Searches
Using the methodology of abstract logic programming in linear logic, we establish a correct and complete translation between the language Nabla and rst order linear logic. Nabla is a modiication of the coordination language Gamma with parallel and sequential composition. Nabla, without modifying Gamma basic computational model, is amenable to this kind of analysis, at the price of a weaker expr...
متن کاملQLB: A Quantified Logic for Belief
This paper describes QLB, a quantified logic of belief that is a possible extension of the modal system KD45n to predicate level. The main features of QLB are that: (i) it is allowed to quantify over the agents of belief; (ii) the belief operator can be indexed by any term of the formal language; (iii) terms are not rigid designators, but are interpreted contextually; (iv) automatic theorem pro...
متن کاملA Formal Model for an Expressive Fragment of XSLT
The extension of the XSL (eXtensible Style sheet Language) by variables and passing of data values between template rules has generated a powerful XML query language: XSLT (eXtensible Style sheet Language Transformations). An informal introduction to XSTL is given, on the bases of which a formal model of a fragment of XSLT is defined. This formal model is in the spirit of tree transducers, and ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007